Welcome![Sign In][Sign Up]
Location:
Search - RSA v

Search list

[Crack Hack300_encrypt

Description: 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds] -encryption algorithm Test Driver for Crypto. a Class C Library of spreadsheets Primitives : - To generate an RSA key cryptest g-To encrypt an d decrypt a string using RSA cryptest r-To calcu late MD5, SHS, and RIPEMD algorithms-160 message digests : cryptest m file-To encrypt and decrypt a string using DES-EDE in CBC mode : cryptest t-To encrypt or decrypt a file cryptes t e | d input output - To share a file into shadows : cryptest's
Platform: | Size: 389062 | Author: Nikii | Hits:

[JSP/Javarel

Description: 1. 如何生成自签名的KeyStore以及导出供SP使用的公钥 C:>keytool -v -genkey -alias idp -keystore idp.jks -keyalg RSA -dname uid=idp 然后按照提示输入密码即可,这里选择输入123456作为密码,同时主口令也使用该密码 C:>keytool -v -export -alias idp -keystore idp.jks -file idp.cer 这个命令将导出公钥证书,公钥证书将会配置在Identity Assertion Provider的Details选项卡中,同时需要配置123456作为访问证书的密码 2. 如何编译 修改build\\目录下build.local.properties文件,将其中的WL_HOME指向具体的WebLogic Server安装目录 然后在build目录下执行ant即可 demo/目录中有编译好的demo应用,可以直接使用
Platform: | Size: 973058 | Author: thomas | Hits:

[Crack HackDSA

Description: Digital Signature Algorithm (DSA)是Schnorr和ElGamal签名算法的变种,被美国NIST作为DSS(DigitalSignature Standard)。算法中应用了下述参数: p:L bits长的素数。L是64的倍数,范围是512到1024; q:p - 1的160bits的素因子; g:g = h^((p-1)/q) mod p,h满足h < p - 1, h^((p-1)/q) mod p > 1; x:x < q,x为私钥 ; y:y = g^x mod p ,( p, q, g, y )为公钥; H( x ):One-Way Hash函数。DSS中选用SHA( Secure Hash Algorithm )。 p, q, g可由一组用户共享,但在实际应用中,使用公共模数可能会带来一定的威胁。签名及验证协议如下: 1. P产生随机数k,k < q; 2. P计算 r = ( g^k mod p ) mod q s = ( k^(-1) (H(m) + xr)) mod q 签名结果是( m, r, s )。 3. 验证时计算 w = s^(-1)mod q u1 = ( H( m ) * w ) mod q u2 = ( r * w ) mod q v = (( g^u1 * y^u2 ) mod p ) mod q 若v = r,则认为签名有效。   DSA是基于整数有限域离散对数难题的,其安全性与RSA相比差不多。DSA的一个重要特点是两个素数公开,这样,当使用别人的p和q时,即使不知道私钥,你也能确认它们是否是随机产生的,还是作了手脚。RSA算法却作不到。
Platform: | Size: 136954 | Author: wildkaede | Hits:

[Crack Hack300_encrypt

Description: 加密算法 Test Driver for Crypto++, a C++ Class Library of Cryptographic Primitives: - To generate an RSA key cryptest g - To encrypt and decrypt a string using RSA cryptest r - To calculate MD5, SHS, and RIPEMD-160 message digests: cryptest m file - To encrypt and decrypt a string using DES-EDE in CBC mode: cryptest t - To encrypt or decrypt a file cryptest e|d input output - To share a file into shadows: cryptest s <pieces> <pieces-needed> file (make sure file has no extension, if you re running this under DOS) - To reconstruct a file from shadows: cryptest j output file1 file2 [....] - To gzip a file: cryptest z <compression-level> input output - To gunzip a file: cryptest u input output - To run validation tests: cryptest v - To run benchmarks: cryptest b [time for each benchmark in seconds] -encryption algorithm Test Driver for Crypto. a Class C Library of spreadsheets Primitives :- To generate an RSA key cryptest g-To encrypt an d decrypt a string using RSA cryptest r-To calcu late MD5, SHS, and RIPEMD algorithms-160 message digests : cryptest m file-To encrypt and decrypt a string using DES-EDE in CBC mode : cryptest t-To encrypt or decrypt a file cryptes t e | d input output- To share a file into shadows : cryptest's
Platform: | Size: 389120 | Author: Nikii | Hits:

[JSP/Javarel

Description: 1. 如何生成自签名的KeyStore以及导出供SP使用的公钥 C:>keytool -v -genkey -alias idp -keystore idp.jks -keyalg RSA -dname uid=idp 然后按照提示输入密码即可,这里选择输入123456作为密码,同时主口令也使用该密码 C:>keytool -v -export -alias idp -keystore idp.jks -file idp.cer 这个命令将导出公钥证书,公钥证书将会配置在Identity Assertion Provider的Details选项卡中,同时需要配置123456作为访问证书的密码 2. 如何编译 修改build\目录下build.local.properties文件,将其中的WL_HOME指向具体的WebLogic Server安装目录 然后在build目录下执行ant即可 demo/目录中有编译好的demo应用,可以直接使用-1. How to generate self-signed, as well as export the KeyStore for SP
Platform: | Size: 972800 | Author: thomas | Hits:

[Crack HackDSA

Description: Digital Signature Algorithm (DSA)是Schnorr和ElGamal签名算法的变种,被美国NIST作为DSS(DigitalSignature Standard)。算法中应用了下述参数: p:L bits长的素数。L是64的倍数,范围是512到1024; q:p - 1的160bits的素因子; g:g = h^((p-1)/q) mod p,h满足h < p - 1, h^((p-1)/q) mod p > 1; x:x < q,x为私钥 ; y:y = g^x mod p ,( p, q, g, y )为公钥; H( x ):One-Way Hash函数。DSS中选用SHA( Secure Hash Algorithm )。 p, q, g可由一组用户共享,但在实际应用中,使用公共模数可能会带来一定的威胁。签名及验证协议如下: 1. P产生随机数k,k < q; 2. P计算 r = ( g^k mod p ) mod q s = ( k^(-1) (H(m) + xr)) mod q 签名结果是( m, r, s )。 3. 验证时计算 w = s^(-1)mod q u1 = ( H( m ) * w ) mod q u2 = ( r * w ) mod q v = (( g^u1 * y^u2 ) mod p ) mod q 若v = r,则认为签名有效。   DSA是基于整数有限域离散对数难题的,其安全性与RSA相比差不多。DSA的一个重要特点是两个素数公开,这样,当使用别人的p和q时,即使不知道私钥,你也能确认它们是否是随机产生的,还是作了手脚。RSA算法却作不到。
Platform: | Size: 136192 | Author: wildkaede | Hits:

[Crack HackRSA(vc)

Description: rsa加密算法,VC环境,基于对画框的演示rsa算法的程序。-rsa encryption algorithm, VC environment, based on a demonstration of frame rsa algorithm procedure.
Platform: | Size: 81920 | Author: 小天 | Hits:

[Crack HackRSA

Description: 利用C\C++实现RSA算法的加、解密运算。 具体包括: 1)利用扩展的Euclid计算 a mod n 的乘法逆元; 2)Miller-Rabin素性测试算法对一个给定的大数进行测试; 3)实现的运算,并计算; 4)利用Euler定理手工计算,并与3)计算的结果对比; 5)实现RSA算法。并对 I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS 加解密。说明:为了方便实现,分组可以小一点,比如两个字母一组。 字母及其数字编码 字母及其数字编码 空格 00 N 14 A 01 O 15 B 02 P 16 C 03 Q 17 D 04 R 18 E 05 S 19 F 06 T 20 G 07 U 21 H 08 V 22 I 09 W 23 J 10 X 24 K 11 Y 25 L 12 Z 26 M 13 -Use of C \ C++ implements the RSA algorithm encryption and decryption operations. These include: 1) using the extended Euclid calculate a mod n multiplicative inverse 2) Miller-Rabin primality testing algorithm for a given test large numbers 3) to achieve the operation, and the calculation 4) the use of Euler Theorem manual calculation, and compared with the results of the calculation 3) 5) implement the RSA algorithm. And I LOVE NANJING UNIVERSITY OF AERONAUTICS AND ASTRONAUTICS encryption and decryption. Description: In order to facilitate the achievement of the packet may be smaller, for example, a group of two letters. Alphabet letters and their digital encoding and digital encoding Spaces 00 N 14 A 01 O 15 B 02 P 16 C 03 Q 17 D 04 R 18 E 05 S 19 F 06 T 20 G 07 U 21 H 08 V 22 I 09 W 23 J 10 X 24 K 11 Y 25
Platform: | Size: 1024 | Author: 刘洋 | Hits:

CodeBus www.codebus.net